Reversible parallel computation: An evolving space-model
نویسندگان
چکیده
منابع مشابه
Evolving Parallel Computation
SFI WORKING PAPER: 1997-05-040 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...
متن کاملTime/Space Trade-Offs for Reversible Computation
A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or in linear time and space O(ST). The former result impl...
متن کاملAn algebra of reversible computation
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
متن کاملA Design-Based Model of Reversible Computation
We investigate, within the UTP framework of designs, the effect of seeing computation as an essentially reversible process. We describe the theoretical link between reversibility and the minimum power requirements of a computation, and we review Zuliani’s work on Reversible pGCL which brings reversible computing within the scope of formal software development. We propose an alternative formalis...
متن کاملA Note on Bennett's Time-Space Tradeoff for Reversible Computation
Given any irreversible program with running time T and space complexity S, and given any e > 0, Bennett shows how to construct an equivalent reversible program with running time O(T1+) and space complexity O(S In T). Although these loose upper bounds are formally correct, they are misleading due to a hidden constant factor in the space bound. It is shown that this constant factor is approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90160-j